Approximation of the Multiplication Table Function
نویسنده
چکیده
In this paper, considering the concept of Universal Multiplication Table, we show that for every n ≥ 2, the inequality: M(n) = #{ij|1 ≤ i, j ≤ n} ≥ n2 N(n2) , holds true with: N(n) = n log 2 log log n ( 1+ 387 200 log log n )
منابع مشابه
Elementary function generators for neural-network emulators
Piece-wise first- and second-order approximations are employed to design commonly used elementary function generators for neural-network emulators. Three novel schemes are proposed for the first-order approximations. The first scheme requires one multiplication, one addition, and a 28-byte lookup table. The second scheme requires one addition, a 14-byte lookup table, and no multiplication. The ...
متن کاملSecond Order Function Approximation with a Single Small Multiplication
This paper presents a new scheme for the hardware evaluation of elementary functions, based on a piecewise second order minimax approximation. The novelty is that this evaluation requires only one small rectangular multiplication. Therefore the resulting architecture combines a small table size, thanks to second-order evaluation, with a short critical path: Consisting of one table lookup, the r...
متن کاملSecond Order Function Approximation Using a Single Multiplication on FPGAs
This paper presents a new scheme for the hardware evaluation of elementary functions, based on a piecewise second order minimax approximation. The novelty is that this evaluation requires only one small rectangular multiplication. Therefore the resulting architecture combines a small table size, thanks to second-order evaluation, with a short critical path: Consisting of one table lookup, the r...
متن کاملPowering by a Table Look-Up and a Multiplication with Operand Modification
An efficient method for generating a power of an operand, i.e., X p for an operand X and a given p, is proposed. It is applicable to ps in the form of ±2 k , where k is any integer and of ±2 1 k ± − 2 2 k , where k1 is any integer and k2 is any nonnegative integer. The reciprocal, the square root, the reciprocal square root, the reciprocal square, the reciprocal cube, and so forth are included....
متن کاملA note on the Zolotarev optimal rational approximation for the overlap Dirac operator
We discuss the salient features of Zolotarev optimal rational approximation for the inverse square root function, in particular, for its applications in lattice QCD with overlap Dirac quark. The theoretical error bound for the matrix-vector multiplication Hw(H 2 w) −1/2Y is derived. We check that the error bound is always satisfied amply, for any QCD gauge configurations we have tested. An empi...
متن کامل